t=int(input())
while t>0:
n=int(input())
array=list(map(int, input().split(' ')[:n]))
s=set()
ans=0
for i in range(n-1,-1,-1):
if array[i] in s:
ans=i+1
break
else:
s.add(array[i])
print(ans)
t-=1 #include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n; cin>>t;
while(t--){
cin>>n;vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
set<int> q;
q.clear();
bool ok = false;
for(int i=n-1;i>=0;i--){
if(q.count(a[i])){
cout<<i + 1<<endl;
ok = true;
break;
}
q.insert(a[i]);
}
if(!ok) cout<<0<<endl;
}
}
1702B - Polycarp Writes a String from Memory | 1701A - Grass Field |
489C - Given Length and Sum of Digits | 886B - Vlad and Cafes |
915A - Garden | 356A - Knight Tournament |
1330A - Dreamoon and Ranking Collection | 1692B - All Distinct |
1156C - Match Points | 1675A - Food for Animals |
1328C - Ternary XOR | 1689A - Lex String |
1708B - Difference of GCDs | 863A - Quasi-palindrome |
1478A - Nezzar and Colorful Balls | 1581B - Diameter of Graph |
404A - Valera and X | 908A - New Year and Counting Cards |
146A - Lucky Ticket | 1594C - Make Them Equal |
1676A - Lucky | 1700B - Palindromic Numbers |
702C - Cellular Network | 1672C - Unequal Array |
1706C - Qpwoeirut And The City | 1697A - Parkway Walk |
1505B - DMCA | 478B - Random Teams |
1705C - Mark and His Unfinished Essay | 1401C - Mere Array |